Multiple Sampling with Constant Probability
نویسندگان
چکیده
منابع مشابه
Constant-pressure nested sampling with atomistic dynamics.
The nested sampling algorithm has been shown to be a general method for calculating the pressure-temperature-composition phase diagrams of materials. While the previous implementation used single-particle Monte Carlo moves, these are inefficient for condensed systems with general interactions where single-particle moves cannot be evaluated faster than the energy of the whole system. Here we enh...
متن کاملSampling Quantum Nonlocal Correlations with High Probability
It is well known that quantum correlations for bipartite dichotomic measurements are those of the form γ = (〈ui, vj〉)i,j=1, where the vectors ui and vj are in the unit ball of a real Hilbert space. In this work we study the probability of the nonlocal nature of these correlations as a function of α = m n , where the previous vectors are sampled according to the Haar measure in the unit sphere o...
متن کاملProbability and Sampling Distributions
When an experiment is conducted, such as tossing coins, rolling a die, sampling for estimating the proportion of defective units, several outcomes or events occur with certain probabilities. These events or outcomes may be regarded as a variable which takes different values and each value is associated with a probability. The values of this variable depends on chance or probability. Such a vari...
متن کاملSampling Probability and Inference
The second part of the book looks into the probabilistic foundation of statistical analysis, which originates in probabilistic sampling, and introduces the reader to the arena of hypothesis testing. Chapter 5 explores the main random and controllable source of error, sampling, as opposed to non-sampling errors, potentially very dangerous and unknown. It shows the statistical advantages of extra...
متن کاملConstant-time Discrete Gaussian Sampling
Sampling from a discrete Gaussian distribution is an indispensable part of lattice-based cryptography. Several recent works have shown that the timing leakage from a non-constant-time implementation of the discrete Gaussian sampling algorithm could be exploited to recover the secret. In this paper, we propose a constant-time implementation of the Knuth-Yao random walk algorithm for performing c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Mathematical Statistics
سال: 1943
ISSN: 0003-4851
DOI: 10.1214/aoms/1177731357